Some constructions of integral graphs

Constructions of antimagic labelings for some families of regular graphs

In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

Some families of integral graphs

A graph is called integral if all its eigenvalues (of the adjacency matrix) are integers. In this paper, the graphs K1,r •Kn , r ∗Kn , K1,r • Km,n , r ∗ Km,n and the tree K1,s • T (q, r,m, t) are defined. We determine the characteristic polynomials of these graphs and also obtain sufficient and necessary conditions for these graphs to be integral. Some sufficient conditions are found by using t...

Some constructions of supermagic non-regular graphs

constructions of antimagic labelings for some families of regular graphs

in this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.

Spectra of Some New Graph Operations and Some New Class of Integral Graphs

In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.